Efficient automatic simulation of parallel computation on networks of workstations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient use of parallel libraries on heterogeneous Networks of Workstations

The paper is motivated by eciency considerations about porting mathematical software from Massively Parallel Processors (MPPs) to Networks of Workstations (NOWs). Heterogeneity of the network is the major obstacle to ef®cient porting: it can be overcome with a specialized system, Programming envIronment for Network of COmputers (PINCO), for monitoring available computational power at di€erent ...

متن کامل

Efficient parallel timing simulation of synchronous models on networks of workstations

In this paper we address the parallel timing simulation of synchronous VLSI designs on a network of workstations (NOWs). We suggest combining cycle based and conventional timing simulation techniques to achieve fast timing simulation even on NOWs which are typically characterized by low bandwidth and high communication latency. In particular we execute a timing simulator on each node of the NOW...

متن کامل

Parallel Application Scheduling on Networks of Workstations Parallel Application Scheduling on Networks of Workstations

Parallel application support is one of the ways that have been recently proposed for exploiting the idle computing capacity of workstation networks. However, it has been unclear how to most eeectively schedule the processors among diierent job requests. The distributed memory nature of such environments and the structure of the corresponding applications cause many solutions that were successfu...

متن کامل

Parallel Application Scheduling on Networks of Workstations

Parallel applications can be executed using the idle computing capacity of workstation clusters. However, it remains unclear how to most effectively schedule the processors among different applications. Processor scheduling algorithms that were successful for shared-memory machines have proven to be inadequate for distributed memory environments due to the high costs of remote memory accesses a...

متن کامل

Implementing Automatic Coordination on Networks of Workstations

Distributed shared objects are a well known approach to achieve independence of the memory model for parallel programming. The illusion of shared (global) objects is a convenient abstraction which leads to ease of programming on both kinds of parallel architectures, shared memory and distributed memory machines. In this paper, we present several different implementation variants for distributed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2006

ISSN: 0166-218X

DOI: 10.1016/j.dam.2005.10.016